Cycles through a prescribed vertex set in N-connected graphs
نویسندگان
چکیده
منابع مشابه
Vertex Removable Cycles of Graphs and Digraphs
In this paper we defined the vertex removable cycle in respect of the following, if $F$ is a class of graphs(digraphs) satisfying certain property, $G in F $, the cycle $C$ in $G$ is called vertex removable if $G-V(C)in in F $. The vertex removable cycles of eulerian graphs are studied. We also characterize the edge removable cycles of regular graphs(digraphs).
متن کاملVertex-dominating cycles in 2-connected bipartite graphs
A cycle C is a vertex-dominating cycle if every vertex is adjacent to some vertex of C. Bondy and Fan [4] showed that if G is a 2-connected graph with δ(G) ≥ 13 (|V (G)| − 4), then G has a vertex-dominating cycle. In this paper, we prove that if G is a 2-connected bipartite graph with partite sets V1 and V2 such that δ(G) ≥ 1 3 (max{|V1|, |V2|}+ 1), then G has a vertex-dominating cycle.
متن کاملVertex-Fault-Tolerant Hamiltonicity of Cube-Connected Cycles Graphs
The graph CCCn has n × 2 vertices, labeled (l,x), where l is an integer between 0 and n − 1 and x is an n-bit binary string. Two vertices (l,x) and (l′,y) are adjacent if and only if either x = y and |l − l′| = 1, or l = l′ and y = (x). A graph G is called k-vertex-fault-tolerant hamiltonian if it remains hamiltonian after removing at most k vertices. In this paper, we will prove that CCCn is 1...
متن کاملCircuits in Graphs through a prescribed Set of Ordered vertices
A circuit in a simple undirected graphG = (V,E) is a sequence of vertices {v1, v2, . . . , vk+1} such that v1 = vk+1 and {vi, vi+1} ∈ E for i = 1, . . . , k. A circuit C is said to be edgesimple if no edge of G is used twice in C. In this article we study the following problem: which is the largest integer k such that, given any subset of k ordered vertices of a graph G, there exists an edge-si...
متن کاملConnected dominating set in graphs without long paths and cycles
The ratio of the connected domination number, γc, and the domination number, γ, is strictly bounded from above by 3. It was shown by Zverovich that for every connected (P5, C5)-free graph, γc = γ. In this paper, we investigate the interdependence of γ and γc in the class of (Pk, Ck)-free graphs, for k ≥ 6. We prove that for every connected (P6, C6)-free graph, γc ≤ γ+1 holds, and there is a fam...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2004
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2003.08.002